Location:
Search - 01 knapsack
Search list
Description: ACM算法问题：0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
Platform: |
Size: 526336 |
Author: 随波 |
Hits:
Description: 背包问题的程序，自己编的程序，程序可运行，没有界面，在dos下使用，可以再codeblocks下运行-Knapsack problem program, the program of their series, the program can be run, there is no interface, use the dos can codeblocks run
Platform: |
Size: 1024 |
Author: xlw |
Hits:
Description: 蛮力法和动态规划法解决01背包问题。输入文件"backpack.in"：第一行两个整数：物品个数N，背包容量.之后N行每行两个整数，分别为物品重量和物品价值-Dynamic programming method to solve the 01 backpacks problem. The input file backpack.in,: two integers: the first line items number N, backpack capacity after two integers N lines, respectively, for the weight of the article and the value of goods
Platform: |
Size: 2048 |
Author: jym |
Hits:
Description: 01背包问题
欢迎大家下载
noj问题
算法-01 knapsack problem are welcome to download noj algorithm
Platform: |
Size: 1024 |
Author: zhangwei |
Hits:
Description:
01背包问题的回溯算法与实现
已知一个容量为M的包和n件物品, 每件物品的重量为wi, 效益值为pi. 若将物品i装入包中, 背包可得到pi的效益值增量. 要求找到一种装入物品的方案, 在不超过包的总容量前提下, 使包获得最大效益值,-01 knapsack problem backtracking algorithm and implementation of
Platform: |
Size: 11264 |
Author: missli |
Hits:
Description: 使用C语言编写的01背包问题源码！可以运行
！-01 knapsack problem source code using C language!
Platform: |
Size: 1091584 |
Author: chenj |
Hits:
Description: 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
Platform: |
Size: 1024 |
Author: xuchao |
Hits:
Description: C#实现的01背包问题，里面使用了接口，适合初学者使用-C# implementation of the 01 knapsack problem, which uses the interface, suitable for beginners to use
Platform: |
Size: 27648 |
Author: |
Hits:
Description: 算法设计与分析01背包优化问题实验
0-1背包问题：
: 有N个物品和一个背包，其中:
物品具有重量 (w1, w2, …, wn) 和价值 (v1, v2, …, vn)
背包的最大重量承受限制为c
如何放置物品可得最高价值?
思路：动态规划 -Algorithm Design and Analysis 01 knapsack optimization experiments 0-1 knapsack problem :: with N items and a backpack, which: goods with a weight (w1, w2, ..., wn) and value (v1, v2, ..., vn) Backpack The maximum weight limit is c bear how to place the highest value of the goods can be? ideas: Dynamic Programming
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 01背包问题——求最大值 非常的实用算法-01 knapsack problem- seek the maximum
Platform: |
Size: 1024 |
Author: jqctbu |
Hits:
Description: 用动态规划算法所编写是01背包问题的实现，能在ACM平台上通过-Prepared by using dynamic programming algorithm implementation is 01 knapsack problem, in ACM Platforms
Platform: |
Size: 1024 |
Author: 刘毅轩 |
Hits:
Description: 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues
Platform: |
Size: 49152 |
Author: 宋 |
Hits:
Description: 使用VC编程工具，C语言实现动态规划算法解决01背包问题-Using the VC programming tool, C language implementation 01 knapsack problem solving dynamic programming algorithm
Platform: |
Size: 169984 |
Author: Google |
Hits:
Description: 回溯法解决01背包问题-Backtracking to solve 01 knapsack problem
Platform: |
Size: 1024 |
Author: joe wu |
Hits:
Description: 01背包模板 多重背包模板 完全背包-01 knapsack template multiple template completely backpack
Platform: |
Size: 40960 |
Author: 陈杰 |
Hits:
Description: home+work其实是01背包问题，二维一维都可以-home+work actually 01 knapsack problem, can be a two-dimensional one-dimensional
Platform: |
Size: 1024 |
Author: 22 |
Hits:
Description: 由Java Swing提供GUI的车库程序（01背包问题的实例化）-Provided by the Java Swing GUI garage program (instantiated 01 knapsack problem)
Platform: |
Size: 3072 |
Author: 王泽宇 |
Hits:
Description: MOEA/D 07 source code for 01-KNAPSACK problem
Platform: |
Size: 1631232 |
Author: hangxu |
Hits:
Description: 这是一个动态规划的问题，这个程序实现的是求多段图最短路径，汉诺塔和01背包问题的程序-This is a dynamic programming problem, the program is seeking to achieve the shortest path map multistage procedure Tower of Hanoi and 01 knapsack problem
Platform: |
Size: 394240 |
Author: 吴雪 |
Hits:
Description: 01背包算法的仿真与动态演示，非常好，对数据结构的理解有帮助。-01 knapsack algorithm simulation and dynamic demonstration, very good, to understand the data structure help.
Platform: |
Size: 185344 |
Author: liusong |
Hits: